A novel bearing multi-fault diagnosis approach based on weighted permutation entropy and an improved SVM ensemble classifier

Timely and accurate state detection and fault diagnosis of rolling element bearings are very critical to ensuring the reliability of rotating machinery. This paper proposes a novel method of rolling bearing fault diagnosis based on a combination of ensemble empirical mode decomposition (EEMD), weighted permutation entropy (WPE) and an improved support vector machine (SVM) ensemble classifier. A hybrid voting (HV) strategy that combines SVM-based classifiers and cloud similarity measurement (CSM) was employed to improve the classification accuracy. First, the WPE value of the bearing vibration signal was calculated to detect the fault. Secondly, if a bearing fault occurred, the vibration signal was decomposed into a set of intrinsic mode functions (IMFs) by EEMD. The WPE values of the first several IMFs were calculated to form the fault feature vectors. Then, the SVM ensemble classifier was composed of binary SVM and the HV strategy to identify the bearing multi-fault types. Finally, the proposed model was fully evaluated by experiments and comparative studies. The results demonstrate that the proposed method can effectively detect bearing faults and maintain a high accuracy rate of fault recognition when a small number of training samples are available

A Feature Extraction Method Based on Feature Fusion and its Application in the Text-Driven Failure Diagnosis Field

As a basic task in NLP (Natural Language Processing), feature extraction directly determines the quality of text clustering and text classification. However, the commonly used TF-IDF (Term Frequency & Inverse Document Frequency) and LDA (Latent Dirichlet Allocation) text feature extraction methods have shortcomings in not considering the text’s context and blindness to the topic of the corpus. This study builds a feature extraction algorithm and application scenarios in the field of failure diagnosis. A text-driven failure diagnosis model is designed to classify and automatically judge which failure mode the failure described in the text belongs to once a failure-description text is entered. To verify the effectiveness of the proposed feature extraction algorithm and failure diagnosis model, a long-term accumulated failure description text of an aircraft maintenance and support system was used as a subject to conduct an empirical study. The final experimental results also show that the proposed feature extraction method can effectively improve the effect of clustering, and the proposed failure diagnosis model achieves high accuracies and low false alarm rates

A Bayesian Failure Prediction Network Based on Text Sequence Mining and Clustering

The purpose of this paper is to predict failures based on textual sequence data. The current failure prediction is mainly based on structured data. However, there are many unstructured data in aircraft maintenance. The failure mentioned here refers to failure types, such as transmitter failure and signal failure, which are classified by the clustering algorithm based on the failure text. For the failure text, this paper uses the natural language processing technology. Firstly, segmentation and the removal of stop words for Chinese failure text data is performed. The study applies the word2vec moving distance model to obtain the failure occurrence sequence for failure texts collected in a fixed period of time. According to the distance, a clustering algorithm is used to obtain a typical number of fault types. Secondly, the failure occurrence sequence is mined using sequence mining algorithms, such as-PrefixSpan. Finally, the above failure sequence is used to train the Bayesian failure network model. The final experimental results show that the Bayesian failure network has higher accuracy for failure prediction

The continuous pollution routing problem

In this paper, we presented an ε-accurate approach to conduct a continuous optimization on the pollution routing problem (PRP). First, we developed an ε-accurate inner polyhedral approximation method for the nonlinear relation between the travel time and travel speed. The approximation error was controlled within the limit of a given parameter ε, which could be as low as 0.01% in our experiments. Second, we developed two ε-accurate methods for the nonlinear fuel consumption rate (FCR) function of a fossil fuel-powered vehicle while ensuring the approximation error to be within the same parameter ε. Based on these linearization methods, we proposed an ε-accurate mathematical linear programming model for the continuous PRP (ε-CPRP for short), in which decision variables such as driving speeds, travel times, arrival/departure/waiting times, vehicle loads, and FCRs were all optimized concurrently on their continuous domains. A theoretical analysis is provided to confirm that the solutions of ε-CPRP are feasible and controlled within the predefined limit. The proposed ε-CPRP model is rigorously tested on well-known benchmark PRP instances in the literature, and has solved PRP instances optimally with up to 25 customers within reasonable CPU times. New optimal solutions of many PRP instances were reported for the first time in the experiments

The aperiodic facility layout problem with time-varying demands and an optimal master-slave solution approach

In many seasonal industries, customer demands are constantly changing over time, and accordingly the facility layout should be re-optimized in a timely manner to adapt to changing material handling patterns among manufacturing departments. This paper investigates the aperiodic facility layout problem (AFLP) that involves arranging facilities layout and re-layout aperiodically in a dynamic manufacturing environment during a given planning horizon. The AFLP is decomposed into a master problem and a combination set of static facility layout problems (FLPs, the slave problems) without loss of optimality, and all problems are formulated as mixed-integer linear programming (MILP) models that can be solved by MIP solvers for small-sized problems. An exact backward dynamic programming (BDP) algorithm with a computational complexity of O(n 2) is developed for the master problem, and an improved linear programming based problem evolution algorithm (PEA-LP) is developed for the traditional static FLP. Computational experiments are conducted on two new problems and twelve well-known benchmark problems from the literature, and the experimental results show that the proposed solution approach is promising for solving the AFLP with practical sizes of problem instances. In addition, the improved PEA-LP found new best solutions for five benchmark problems

Optimal mathematical programming and variable neighborhood search for k-modes categorical data clustering

The conventional k-modes algorithm and its variants have been extensively used for categorical data clustering. However, these algorithms have some drawbacks, e.g., they can be trapped into local optima and sensitive to initial clusters/modes. Our numerical experiments even showed that the k-modes algorithm could not identify the optimal clustering results for some special datasets regardless the selection of the initial centers. In this paper, we developed an integer linear programming (ILP) approach for the k-modes clustering, which is independent to the initial solution and can obtain directly the optimal results for small-sized datasets. We also developed a heuristic algorithm that implements iterative partial optimization in the ILP approach based on a framework of variable neighborhood search, known as IPO-ILP-VNS, to search for near-optimal results of medium and large sized datasets with controlled computing time. Experiments on 38 datasets, including 27 synthesized small datasets and 11 known benchmark datasets from the UCI site were carried out to test the proposed ILP approach and the IPO-ILP-VNS algorithm. The experimental results outperformed the conventional and other existing enhanced k-modes algorithms in literature, updated 9 of the UCI benchmark datasets with new and improved results

Cost Modelling to Support Optimum Selection of Life Extension Strategy for Industrial Equipment in Smart Manufacturing

Industrial equipment/machinery is an important element of manufacturing. They are used for producing objects that people need for everyday use. Therefore, there is a challenge to adopt effective maintenance strategies to keep them well-functioning and well-maintained in production lines. This will save energy and materials and contribute genuinely to the circular economy and creating value. Remanufacturing or refurbishment is one of the strategies to extend life of such industrial equipment. The paper presents an initial framework of cost estimation model based on combination of activity-based costing (ABC) and human expertise to assist the decision-making on best life extension strategy (e.g. remanufacturing, refurbishment, repair) for industrial equipment. Firstly, ABC cost model is developed to calculate cost of life extension strategy to be used as a benchmark strategy. Next, expert opinions are employed to modify data of benchmark strategy, which is then used to estimate costs of other life extension strategies. The developed cost model has been implemented in VBA-based Excel® platform. A case study with application examples has been used to demonstrate the results of the initial cost model developed and its applicability in estimating and analysing cost of applying life extension strategy for industrial equipment. Finally, conclusions on the developed cost model have been reported

A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems

In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold. First, we developed an effective local search method known as the Ancestors Depth-first Traversal Search (ADTS), which can be embedded in the VNS to significantly improve the solution quality. Second, we proposed a common and efficient approach for the rapid calculation of the cost change for the VNS and other generate-and-test algorithms. The new VNS algorithm was tested against 176 benchmark problems of different scales (small, medium, and large). The experimental results show that the new VNS algorithm outperforms all of the existing algorithms in the literature for solving uncapacitated MLLS problems because it was able to find all optimal solutions (100%) for 96 small-sized problems and new best-known solutions for 5 of 40 medium-sized problems and for 30 of 40 large-sized problems

The Optimal Width and Mechanism of Riparian Buffers for Storm Water Nutrient Removal in the Chinese Eutrophic Lake Chaohu Watershed

Riparian buffers play an important role in intercepting nutrients entering lakes from non-point runoffs. In spite of its ecological significance, little is known regarding the underlying mechanisms of riparian buffers or their optimal width. In this study, we examined nutrient removal efficiency, including the quantity of nutrients and water quality, in the littoral zone of different types of riparian buffers in the watershed around eutrophic Lake Chaohu (China), and estimated the optimal width for different types of riparian buffers for effective nutrient removal. In general, a weak phosphorus (P) adsorption ability and nitrification-denitrification potential in soil resulted in a far greater riparian buffer demand than before in Lake Chaohu, which may be attributed to the soil degradation and simplification of cover vegetation. In detail, the width was at least 23 m (grass/forest) and 130 m (grass) for total P (TP) and total nitrogen (TN) to reach 50% removal efficiency, respectively, indicating a significantly greater demand for TN removal than that for TP. Additionally, wetland and grass/forest riparian buffers were more effective for TP removal, which was attributed to a high P sorption maximum (Qmax) and a low equilibrium P concentration (EPC0), respectively. The high potential nitrification rate (PNR) and potential denitrification rate (PDR) were responsible for the more effective TN removal efficiencies in grass riparian buffers. The nutrient removal efficiency of different types of riparian buffers was closely related with nutrient level in adjacent littoral zones around Lake Chaohu